Constraints for Input/Output Logics

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scaling of global inputoutput networks

Examining scaling patterns of networks can help understand how structural features relate to the behavior of the networks. Input–output networks consist of industries as nodes and inter-industrial exchanges of products as links. Previous studies consider limitedmeasures for node strengths and link weights, and also ignore the impact of dataset choice. We consider a comprehensive set of indicato...

متن کامل

Temporal Logics with Local Constraints ∗

Recent decidability results on the satisfiability problem for temporal logics, in particular LTL, CTL∗ and ECTL∗, with constraints over external structures like the integers with the order or infinite trees are surveyed in this paper. 1998 ACM Subject Classification F.4.1 Mathematical Logic

متن کامل

Path-Based Identification Constraints in Description Logics

In spite of the importance of identification mechanisms in ontology engineering, the Description Logics at the basis of current reasoners do not include modeling features for expressing identification constraints. In this paper, we consider a powerful class of identification constraints, which allow for using roles, inverses, and paths, thus capturing sophisticated forms of identifications ofte...

متن کامل

Complexity of modal logics with Presburger constraints

We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as number restrictions in description logics. We show that EML satisfiability is only pspace-complete by designing a Ladner-like algorithm. This extends a well-known and non-trivial pspace upper bound for graded modal logic...

متن کامل

Rational constraints on bdi logics (draft)

This note attempts to clarify some desirable properties of rational reasoning in artificial intelligent agents. Although the ultimate goal is the formalisation of such principles, in this paper no formal (mathematical) detail will be addressed, let alone computational ones. The main rationale guiding this study, in fact, is the belief that the conceptual problems in ai are crying out for unders...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Philosophical Logic

سال: 2001

ISSN: 0022-3611,1573-0433

DOI: 10.1023/a:1017599526096